The bondage numbers of graphs with small crossing numbers
نویسندگان
چکیده
The bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number (G) ofG. Kang andYuan proved b(G) 8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results to connected graphs with small crossing numbers. © 2006 Elsevier B.V. All rights reserved. MSC: 05C69; 05C12
منابع مشابه
The bondage numbers and efficient dominations of vertex-transitive graphs
The bondage number of a graph G is the minimum number of edges whose removal results in a graph with larger domination number.A dominating setD is called an efficient dominating set ofG if |N−[v]∩D|=1 for every vertex v ∈ V (G). In this paper we establish a tight lower bound for the bondage number of a vertex-transitive graph. We also obtain upper bounds for regular graphs by investigating the ...
متن کاملThe Bondage Number of Graphs with Crossing Number Less than Four
The bondage number b(G) of a graph G is the smallest number of edges whose removal results in a graph with domination number greater than the domination number of G. Kang and Yuan [Bondage number of planar graphs. Discrete Math. 222 (2000), 191198] proved b(G) 6 min{8,∆+ 2} for every connected planar graph G, where ∆ is the maximum degree of G. Later Carlson and Develin [On the bondage number o...
متن کاملOn Bondage Numbers of Graphs: A Survey with Some Comments
The domination number of a graph G is the smallest number of vertices which dominate all remaining vertices by edges of G. The bondage number of a nonempty graphG is the smallest number of edges whose removal fromG results in a graph with domination number greater than the domination number of G. The concept of the bondage number was formally introduced by Fink et al. in 1990. Since then, this ...
متن کاملRoman bondage numbers of some graphs
A Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value f(G) = ∑ u∈V f(u). The Roman domination number of G is the minimum weight of a Roman dominating function on G. The Roman bondage number of a nonempty ...
متن کاملMinimal regular graphs with given girths and crossing numbers
This paper investigates on those smallest regular graphs with given girths and having small crossing numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007